Improved k-means and spectral matching for hyperspectral mineral mapping
نویسندگان
چکیده
منابع مشابه
Hyperspectral Image Analysis for Material Mapping Using Spectral Matching
Recently, hyperspectral image analysis has obtained successful results in information extraction for earth remote sensing system. The data produced with this type of analysis is an important component of geographic databases. The domain of interest of such data covers a very large area of applications like target detection, pattern classification, material mapping and identification, etc. Mater...
متن کاملComparison of AVIRIS and Hyperion for Hyperspectral Mineral Mapping
1.0 Introduction The 0.4 to 2.5 μm spectral range provides abundant information about many important Earth-surface minerals (Clark et al., 1990). In particular, the 2.0 to 2.5 μm spectral range covers spectral features of hydroxyl-bearing minerals, sulfates, and carbonates common to many geologic units and hydrothermal alteration assemblages. Imaging Spectrometers, or “Hyperspectral” sensors pr...
متن کاملImproved and Simplified Inapproximability for k-means
The k-means problem consists of finding k centers in R that minimize the sum of the squared distances of all points in an input set P from R to their closest respective center. Awasthi et. al. recently showed that there exists a constant ε′ > 0 such that it is NP-hard to approximate the k-means objective within a factor of 1 + ε′. We establish that the constant ε′ is at least 0.0013. For a give...
متن کاملSpectral Relaxation for K-means Clustering
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to find local minima. In this paper we show that the minimization can be reformulated as a trace maximization problem associated with the Gram matrix of the data vectors. Furthermore, we show that a relaxed version of the trace maximization problem possesse...
متن کاملK-P-Means: A Clustering Algorithm of K "Purified" Means for Hyperspectral Endmember Estimation
This letter presents K-P-Means, a novel approach for hyperspectral endmember estimation. Spectral unmixing is formulated as a clustering problem, with the goal of K-P-Means to obtain a set of “purified” hyperspectral pixels to estimate endmembers. The K-P-Means algorithm alternates iteratively between two main steps (abundance estimation and endmember update) until convergence to yield final en...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Applied Earth Observation and Geoinformation
سال: 2020
ISSN: 0303-2434
DOI: 10.1016/j.jag.2020.102154